Spectrum of Sierpiński triangles using MATLAB
نویسندگان
چکیده
The set of eigenvalues of a graph together with their multiplicities is called the spectrum of . The knowledge of spectrum can be used to obtain various topological properties of graphs like connectedness, toughness and many more. In this paper we use MATLAB to completely describe the spectrum of Sierpiński graphs and Sierpiński triangles, thus adding to the classes of graphs whose spectrum is known.
منابع مشابه
Simulation of the self-assembly of simple molecular bricks into Sierpiński triangles.
The canonical lattice Monte Carlo simulation was used to demonstrate the surface-confined mixed self-assembly of 120° ditopic organic tectons and metal atoms into ordered hierarchical structures resembling the mathematical fractal set called the Sierpiński triangle.
متن کاملVectorized Matlab codes for linear two-dimensional elasticity
A vectorized Matlab implementation for the P1 finite element is provided for the twodimensional linear elasticity with mixed boundary conditions. Vectorization means that there is no loop over triangles. Numerical experiments show that our implementation is more efficient than the standard implementation with a loop over all triangles.
متن کاملSimilar Triangles, Another Trace of the Golden Ratio
In this paper we investigate similar triangles which are not congruent but have two pair congruent sides. We show that greatest lower bound of values for similarity ratio of such triangles is golden ratio. For right triangles, we prove that the supremum of values for similarity ratio is the square root of the golden ratio.
متن کاملWord-Representability of Face Subdivisions of Triangular Grid Graphs
A graph G = (V,E) is word-representable if there exists a word w over the alphabet V such that letters x and y alternate in w if and only if (x, y) ∈ E. A triangular grid graph is a subgraph of a tiling of the plane with equilateral triangles defined by a finite number of triangles, called cells. A face subdivision of a triangular grid graph is replacing some of its cells by plane copies of the...
متن کاملOn Multivariate Chebyshev Polynomials and Spectral Approximations on Triangles
In this paper we describe the use of multivariate Chebyshev polynomials in computing spectral derivations and Clenshaw–Curtis type quadratures. The multivariate Chebyshev polynomials give a spectrally accurate approximation of smooth multivariate functions. In particular we investigate polynomials derived from the A2 root system. We provide analytic formulas for the gradient and integral of A2 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012